Grammars, Deductive Systems, and Parsing
نویسندگان
چکیده
Many theories of grammar and styles of grammar speciication have stemmed from mathematical logic, computer science, and computational linguistics, and have been used for describing natural languages. By a series of constructions, we relate categorial, attribute and logic grammars via (axiomatic) labelled deductive systems, and extend this relation to accommodate uniication-based grammars and so-called Montague Grammar. The axioms of a labelled deductive system can also be used to constrain the proof search by automatically generating an LR parser from them; we describe the implementation of such a parser-generator. Furthermore, we show how a modiication of the LR parsing algorithm, plus the (meta-level) information contained in the axioms, can be used to parse a grammar speciication which is based on procedural rather than combinatorial properties of the language.
منابع مشابه
Deductive Parsing in Interaction Grammars
We present a parsing algorithm for Interaction Grammars using the deductive parsing framework. This approach brings new perspectives to this problem, departing from previous methods which rely on constraint-solving techniques.
متن کاملDeductive Parsing with Interaction Grammars
We present a parsing algorithm for Interaction Grammars using the deductive parsing framework. This approach brings new perspectives to this problem, departing from previous methods which rely on constraint-solving techniques.
متن کاملMontague Grammars as Deductive Databases
This paper presents a technique for further applications of deductive databases in the eld of natural language processing. Although there were enormous research eeorts on analyzing the semantics of natural languages (NL), especially using Montague grammars (PTQ) for Prolog, corresponding programs for deductive databases are still missing, since range restriction is required in nearly all deduct...
متن کاملWeighted Deductive Parsing and Knuth's Algorithm
As for algorithms in general, there are significant advantages to specifying parsing algorithms in a modular way (i.e., as the combination of subalgorithms). First, modular specifications often allow simpler implementations. Secondly, if otherwise seemingly distinct types of parser are described in a modular way, the common parts can often be more readily identified, which helps to classify and...
متن کاملChart Parsing Multimodal Grammars
The short note describes the chart parser for multimodal type-logical grammars which has been developed in conjunction with the type-logical treebank for French. The chart parser presents an incomplete but fast implementation of proof search for multimodal type-logical grammars using the"deductive parsing"framework. Proofs found can be transformed to natural deduction proofs.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1992